A Primal-Dual Formulation for Certifiable Computations in Schubert Calculus

نویسندگان

  • Jonathan D. Hauenstein
  • Nickolas Hein
  • Frank Sottile
چکیده

Formulating a Schubert problem as the solutions to a system of equations in either Plücker space or in the local coordinates of a Schubert cell typically involves more equations than variables. We present a novel primal-dual formulation of any Schubert problem on a Grassmannian or flag manifold as a system of bilinear equations with the same number of equations as variables. This formulation enables numerical computations in the Schubert calculus to be certified using algorithms based on Smale’s α-theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Certifiable Numerical Computations in Schubert Calculus

Traditional formulations of geometric problems from the Schubert calculus, either in Plücker coordinates or in local coordinates provided by Schubert cells, yield systems of polynomials that are typically far from complete intersections and (in local coordinates) typically of degree exceeding two. We present an alternative primal-dual formulation using parametrizations of Schubert cells in the ...

متن کامل

A Primal-to-Primal Discretization of Exterior Calculus on Polygonal Meshes

Discrete exterior calculus (DEC) offers a coordinate-free discretization of exterior calculus especially suited for computations on curved spaces. We present an extended version of DEC on surface meshes formed by general polygons that bypasses the construction of any dual mesh and the need for combinatorial subdivisions. At its core, our approach introduces a polygonal wedge product that is com...

متن کامل

A Quasi-variational Inequality Problem in Superconductivity

We derive a class of analytical solutions and a dual formulation of a scalar two-space-dimensional quasi-variational inequality problem in applied superconductivity. We approximate this formulation by a fully practical ̄nite element method based on the lowest order Raviart Thomas element, which yields approximations to both the primal and dual variables (the magnetic and electric ̄elds). We prove...

متن کامل

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

متن کامل

Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds

In this paper we derive and exploit duality in general two-stage adaptive linear optimization models. The equivalent dualized formulation we derive is again a two-stage adaptive linear optimization model. Therefore, all existing solution approaches for two-stage adaptive models can be used to solve or approximate the dual formulation. The new dualized model differs from the primal formulation i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Foundations of Computational Mathematics

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2016